A Survey on Earliest Arrival Flows and a Study of the Series-Parallel Case
نویسنده
چکیده
Acknowledgement I am most grateful to my Lord and God Jesus Christ who is truly worthy of all praise. I especially praise and thank Him for all His help concerning this work. I am also very grateful to Jun. Prof. Dr. Stefan Ruzika for his help and guidance and especially for his patience. I also thank Heike Sperber for sharing her knowledge of series-parallel graphs with me.
منابع مشابه
Earliest arrival flows on series-parallel graphs
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival flow problem this algorithm runs in polynomial time.
متن کاملThe investigation of supply chain's reliability measure: a case study
In this paper, using supply chain operational reference, the reliability evaluation of available relationships in supply chain is investigated. For this purpose, in the first step, the chain under investigation is divided into several stages including first and second suppliers, initial and final customers, and the producing company. Based on the formed relationships between t...
متن کاملEarliest Arrival Flows in Networks with Multiple Sinks
Earliest arrival flows model a central aspect of evacuation planning: In a dangerous situation, as many individuals as possible should be rescued at any point in time. Unfortunately, given a network with multiple sinks, flows over time satisfying this condition do not always exist. We analyze the special case of flows over time with zero transit times and characterize which networks always allo...
متن کاملA case study of flood dynamic wave simulation in natural waterways using numerical solution of unsteady flows
Flood routing has many applications in engineering projects and helps designers in understanding the flood flow characteristics in river flows. Floods are taken unsteady flows that vary by time and location. Equations governing unsteady flows in waterways are continuity and momentum equations which in case of one-dimensional flow the Saint-Venant hypothesis is considered. Dynamic wave model as ...
متن کاملApproximating Earliest Arrival Flows with Flow-Dependent Transit Times
For the earliest arrival flow problem one is given a network G = (V,A) with capacities u(a) and transit times τ(a) on its arcs a ∈ A, together with a source and a sink vertex s, t ∈ V . The objective is to send flow from s to t that moves through the network over time, such that for each point in time θ ∈ [0, T ) the maximum possible amount of flow reaches t. If, for each θ ∈ [0, T ) this flow ...
متن کامل